منابع مشابه
On the Cofinality of the Smallest Covering of the Real Line by Meager Sets
We study the ideal of meager sets and related ideals.
متن کاملA Surprising Covering of the Real Line
We construct an increasing sequence of Borel subsets of R, such that their union is R, but R cannot be covered with countably many translations of one set. The proof uses a random method.
متن کاملOn Visibility and Covering by Convex Sets
A set X IR d is n-convex if among any n its points there exist two such that the segment connecting them is contained in X. Perles and Shelah have shown that any closed (n + 1)-convex set in the plane is the union of at most n 6 convex sets. We improve their bound to 18n 3 , and show a lower bound of order (n 2). We also show that if X IR 2 is an n-convex set such that its complement has one-po...
متن کاملOn-Line Machine Covering
We consider the problem of scheduling a sequence of jobs to m parallel machines as to maximize the minimum load over the machines. This situation corresponds to a case that a system which consists of the m machines is alive (i.e. productive) only when all the machines are alive, and the system should be maintained alive as long as possible. It is well known that any on-line deterministic algori...
متن کاملClosed Sets Which Consistently Have Few Translates Covering the Line
We characterize the compact subsets K of 2ω for which one can force the existence of a set X of cardinality less than the continuum such that K +X = 2ω .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1988
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1988.131.1